Supplementary material for a unified framework for high - dimensional analysis of M - estimators with decomposable regularizers
نویسندگان
چکیده
Sahand Negahban, Department of EECS, Massachusetts Institute of Technology, Cambridge MA 02139 (e-mail: [email protected]). Pradeep Ravikumar, Department of CS, University of Texas, Austin, Austin, TX 78701 (e-mail: [email protected]). Martin J. Wainwright, Department of EECS and Statistics, University of California Berkeley, Berkeley CA 94720 (e-mail: [email protected]). Bin Yu, Department of Statistics, University of California Berkeley, Berkeley CA 94720 (e-mail: [email protected]). Sahand Negahban, Department of EECS, Massachusetts Institute of Technology, Cambridge MA 02139 (e-mail: [email protected]). Pradeep Ravikumar, Department of CS, University of Texas, Austin, Austin, TX 78701 (e-mail: [email protected]). Martin J. Wainwright, Department of EECS and Statistics, University of California Berkeley, Berkeley CA 94720 (e-mail: [email protected]). Bin Yu, Department of Statistics, University of California Berkeley, Berkeley CA 94720 (e-mail: [email protected]).
منابع مشابه
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible to obtain consistent procedures unless p/n → 0, a line of recent work has studied models with various types of low-dimensional structure, including sparse vectors, sparse and structured matrices, low-rank matrices, and...
متن کاملOn model selection consistency of M-estimators with geometrically decomposable penalties
Penalized M-estimators are used in diverse areas of science and engineering to fit high-dimensional models with some low-dimensional structure. Often, the penalties are geometrically decomposable, i.e. can be expressed as a sum of support functions over convex sets. We generalize the notion of irrepresentable to geometrically decomposable penalties and develop a general framework for establishi...
متن کاملPicasso: A Sparse Learning Library for High Dimensional Data Analysis in R and Python
We describe a new library named picasso, which implements a unified framework of pathwise coordinate optimization for a variety of sparse learning problems (e.g., sparse linear regression, sparse logistic regression, sparse Poisson regression and sparse square root loss linear regression), combined with efficient active set selection strategies. Besides, the library allows users to choose diffe...
متن کاملFree Vibration Analysis of Bidirectional Functionally Graded Conical/Cylindrical Shells and Annular Plates on Nonlinear Elastic Foundations, Based on a Unified Differential Transform Analytical Formulation
In the present research, a unified formulation for free vibration analysis of the bidirectional functionally graded conical and cylindrical shells and annular plates on elastic foundations is developed. To cover more individual cases and optimally tailored material properties, the material properties are assumed to vary in both the meridian/radial and transverse directions. The shell/plate is a...
متن کاملOn model selection consistency of regularized M-estimators
Penalized M-estimators are used in many areas of science and engineering to fit models with some low-dimensional structure in high-dimensional settings. In many problems arising in machine learning, signal processing, and high-dimensional statistics, the penalties are geometrically decomposable, i.e. can be expressed as a sum of support functions. We generalize the notion of irrepresentability ...
متن کامل